Local Fusion Graphs for Symmetric Groups

نویسندگان

  • John J Ballantyne
  • Nicholas M Greer
  • Peter J Rowley
  • John Ballantyne
  • Nicholas Greer
  • Peter Rowley
چکیده

For a group G, π a set of odd positive integers and X a set of involutions of G we define a graph Fπ(G,X). This graph, called a π-local fusion graph, has vertex set X with x, y ∈ X joined by an edge provided x 6= y and the order of xy is in π. In this paper we investigate Fπ(G,X) when G is a finite symmetric group for various choices of X and π.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cubic symmetric graphs of orders $36p$ and $36p^{2}$

A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

متن کامل

A NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS

The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.

متن کامل

Classifying pentavalnet symmetric graphs of order $24p$

A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.

متن کامل

A characterization of the symmetric group of prime degree

Let $G$ be a finite group and $Gamma(G)$ the prime graph of $G$‎. ‎Recently people have been using prime graphs to study simple groups‎. ‎Naturally we pose a question‎: ‎can we use prime graphs to study almost‎ ‎simple groups or non-simple groups? In this paper some results in‎ ‎this respect are obtained and as follows‎: ‎$Gcong S_p$ if and only‎ ‎if $|G|=|S_p|$ and $Gamma(G)=Gamma(S_p)$‎, ‎whe...

متن کامل

COMPUTING THE EIGENVALUES OF CAYLEY GRAPHS OF ORDER p2q

A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of $Gamma$. In this paper, we classify all connected tetravalent normal symmetric Cayley graphs of order $p^2q$ where $p>q$ are prime numbers.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012